New Construction of Deterministic Compressed Sensing Matrices via Singular Linear Spaces over Finite Fields
نویسنده
چکیده
As an emerging approach of signal processing, not only has compressed sensing (CS) successfully compressed and sampled signals with few measurements, but also has owned the capabilities of ensuring the exact recovery of signals. However, the above-mentioned properties are based on the (compressed) sensing matrices. Hence the construction of sensing matrices is the key problem. Compared with the intensive study of random sensing matrices, only a few deterministic constructions are known. In this paper, we provide a family of new construction of deterministic sensing matrices via singular linear spaces over finite fields, and show its better performance than Devore’s construction using polynomials over finite fields. Key–Words: Compressed sensing matrices, Singular linear spaces, Coherence, Restricted isometry property (RIP).
منابع مشابه
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However...
متن کاملOn the Compressed Measurements over Finite Fields: Sparse or Dense Sampling
We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the finite fields are varied. One of interesting conclusions includes that unless the signal is “ultra” sparse, the sensing matrices do not have to be dense. Keywor...
متن کاملDeterministic Designs with Deterministic Guarantees: Toeplitz Compressed Sensing Matrices, Sequence Design and System Identification
In this paper we present a new family of discrete sequences having “random like” uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers. Exploiting results from the theory of continued fractions and diophantine approximations, we show that the class of sequences so formed has the property that the w...
متن کاملCompressed sensing and designs: theory and simulations
In An asymptotic result on compressed sensing matrices [4], a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we analyse the performance of these matrices using deterministic and probabilistic methods. We provide a new recovery algorithm and detailed simulations. These simulations suggest that the construction is competitive with...
متن کاملA new method on deterministic construction of the measurement matrix in compressed sensing
Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic constructi...
متن کامل